Distributed safe resource allocation using barrier functions

Resource allocation plays a central role in networked systems such as smart grids, communication networks, and urban transportation systems. In these systems, many constraints have physical meaning infeasible allocations can result system breakdown. Hence, algorithms with asymptotic feasibility guarantees be insufficient since they cannot ensure that an implementable solution is found finite time. This paper proposes distributed feasible method (DFM) for resource based on barrier functions. DFM, every iterate safe to implement it does not violate the constraints. We prove that, under mild conditions, DFM converges arbitrarily small neighborhood of optimum. Numerical experiments demonstrate competitive performance DFM.